Remarks on continuum cardinals on Boolean algebras
نویسنده
چکیده
For set-theoretical notation we follow [3]. We follow [2] for Boolean algebraic notation, and Monk [5] for more specialized notation concerning cardinal functions on Boolean algebras. Fr(κ) is the free Boolean algebra on κ generators. A is the completion of A. If L is a linear order, then Intalg(L) is the interval algebra over L (perhaps after adjoining a first element to L). Any element x of Intalg(L) has the form [a0 , b0) ∪ · · · ∪ [am−1 , bm−1), with a0 < b0 < · · · < bm−1 ≤ ∞. (Here ∞ is not in L.) The intervals [ai, bi) are called the components of x. Now we define some notions entering into the definitions of our cardinal functions: A tower in A is a subset T of A well-ordered by the Boolean ordering in a limit ordinal type and with sum 1. We say that X is weakly dense in A if for all a ∈ A there is an x ∈ X+ such that x ≤ a or x ≤ −a. A weak partition of A is a system 〈bξ : ξ < α〉 of pairwise disjoint elements with sum 1; it is not assumed that all bξ are nonzero. We say that X ⊆ A is independent if for all F,G ∈ [X] we have [ F ∩G = ∅ → ∏ x∈F x · ∏ x∈G −x = 0 ] ; we say that it is ideal independent if for all x ∈ X and all F ∈ [X\{x}]<ω we have that x ≤ ∑ y∈F y. A set X ⊆ A+ is dense in an ultrafilter D of A if for all a ∈ D there is an x ∈ X such that x ≤ a. It is not assumed that X ⊆ D. A subset X of A+ splits A if for every a ∈ A for which A a is infinite there is an x ∈ X such that a ·x = 0 = a ·−x. A free sequence in a Boolean algebra A is a sequence 〈aξ : ξ < α〉 of elements of A such that
منابع مشابه
Remarks on measurable Boolean algebras and sequential cardinals
The paper offers a generalization of Kalton–Roberts’ theorem on uniformly exhaustive Maharam’s submeasures to the case of arbitrary sequentially continuous functionals. Applying the result one can reduce the problem of measurability of sequential cardinals to the question whether sequentially continuous functionals are uniformly exhaustive.
متن کاملσ-Entangled Linear Orders and Narrowness of Products of Boolean Algebras
We investigate σ-entangled linear orders and narrowness of Boolean algebras. We show existence of σ-entangled linear orders in many cardinals, and we build Boolean algebras with neither large chains nor large pies. We study the behavior of these notions in ultraproducts. ∗ Partially supported by the Deutsche Forschungsgemeinschaft, Grant No. Ko 490/7-1. Publication 462.
متن کاملFilter theory in MTL-algebras based on Uni-soft property
The notion of (Boolean) uni-soft filters in MTL-algebras is introduced, and several properties of them are investigated. Characterizations of (Boolean) uni-soft filters are discussed, and some (necessary and sufficient) conditions for a uni-soft filter to be Boolean are provided. The condensational property for a Boolean uni-soft filter is established.
متن کاملDepth+ and Length+ of Boolean Algebras
Suppose κ = cf(κ), λ > cf(λ) = κ and λ = λ. We prove that there exist a sequence 〈Bi : i < κ〉 of Boolean algebras and an ultrafilterD on κ so that λ = ∏ i<κ Depth(Bi)/D < Depth ( ∏ i<κ Bi/D) = λ . An identical result holds also for Length. The proof is carried in ZFC, and it holds even above large cardinals. 2010 Mathematics Subject Classification. Primary: 06E05, 03G05. Secondary: 03E45.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 58 شماره
صفحات -
تاریخ انتشار 2012